Sets of Large Dimension Not Containing Polynomial Configurations
نویسنده
چکیده
The main result of this paper is the following. Given countably many multivariate polynomials with rational coefficients and maximum degree d, we construct a compact set E ⊂ Rn of Hausdorff dimension n/d which does not contain finite point configurations corresponding to the zero sets of the given polynomials. Given a set E ⊂ Rn, we study the angles determined by three points of E. The main result implies the existence of a compact set in Rn of Hausdorff dimension n/2 which does not contain the angle π/2. (This is known to be sharp if n is even.) We show that there is a compact set of Hausdorff dimension n/8 which does not contain an angle in any given countable set. We also construct a compact set E ⊂ Rn of Hausdorff dimension n/6 for which the set of angles determined by E is Lebesgue null. In the other direction, we present a result that every set of sufficiently large dimension contains an angle ε close to any given angle. The main result can also be applied to distance sets. As a corollary we obtain a compact set E ⊂ Rn (n ≥ 2) of Hausdorff dimension n/2 which does not contain rational distances nor collinear points, for which the distance set is Lebesgue null, moreover, every distance and direction is realised only at most once by E.
منابع مشابه
Asymptotics of Best-packing on Rectifiable Sets
We investigate the asymptotic behavior, as N grows, of the largest minimal pairwise distance of N points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal configurations. For this purpose, we compare best-packing configurations with minimal Riesz s-energy configurations and determine the s-th root asymptotic behavi...
متن کاملSets of large values of correlation functions for polynomial cubic configurations
We prove that for any set E ⊆ Z with upper Banach density d(E) > 0, the set “of cubic configurations” in E is large in the following sense: for any k ∈ N and any ε > 0, the set {(n1, . . . , nk) ∈ Z k : d( ⋂ e1,...,ek∈{0,1} (E − (e1n1 + · · ·+ eknk))) > d (E) k − ε} is an AVIP0set. We then generalize this result to the case “of polynomial cubic configurations” e1p1(n) + · · · + ekpk(n) where th...
متن کاملOn Generating All Maximal Independent Sets
Generating all configurations that satisfy a given specification (e.g., all permutations of n objects that do not fix any object) is a well-studied problem in combinatorics [6]. Graph theory suggests many interesting problems of this type (see, e.g., [7]). Among them, generating all maximal independent sets of a given graph is one that has attracted considerable attention in the past [4,5,8]. (...
متن کاملDimension Reduction Techniques for Training Polynomial Networks
We propose two novel methods for reducing dimension in training polynomial networks. We consider the class of polynomial networks whose output is the weighted sum of a basis of monomials. Our first method for dimension reduction eliminates redundancy in the training process. Using an implicit matrix structure, we derive iterative methods that converge quickly. A second method for dimension redu...
متن کامل?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups
In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...
متن کامل